Depth-first search and strong connectivity in Coq
نویسنده
چکیده
Using Coq, we mechanize Wegener’s proof of Kosaraju’s linear-time algorithm for computing the strongly connected components of a directed graph. Furthermore, also in Coq, we define an executable and terminating depth-first search algorithm.
منابع مشابه
Brain Connectivity Reflected in Electroencephalogram Coherence in Individuals With Autism: A Meta-analysis
Introduction: Many theories have been proposed about the etiology of autism. One is related to brain connectivity in patients with autism. Several studies have reported brain connectivity changes in autism disease. This study was performed on Electroencephalogram (EEG) studies that evaluated patients with autism, using functional brain connectivity, and compared them with typically-developing i...
متن کاملPointer Program Derivation Using Coq: Graphs and Schorr-Waite Algorithm
We present a specification, a derivation and total correctness proofs of operations for bi-functional graphs implemented with pointers, including the Schorr-Waite algorithm. This one marks such a graph with an economical depth-first strategy. Our approach is purely algebraic and functional, from a simple graph specification to the simulation of a tailrecursive imperative program, then to a true...
متن کاملI/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs
We present the first I/O-efficient algorithms for the following fundamental problems on directed planar graphs: finding the strongly connected components, finding a simple-path 3 -separator, and computing a depth-first spanning (DFS) tree. Our algorithms for the first two problems perform O(sort(N)) I/Os, where N = V + E and sort(N) = Θ((N/B) logM/B(N/B)) is the number of I/Os required to sort ...
متن کاملReview on Coverage and Connectivity in Underwater Wireless Sensor Networks
One of the current trends of the wireless communication is the underwater communication .The two most fundamental problems in underwater sensor network are sensing coverage and network connectivity. The coverage problem reflects how well a sensor network is tracked or monitored by sensors. An underwater wireless sensor networks is the emerging field that is having the challenges in each field s...
متن کاملPath-based depth-first search for strong and biconnected components
Depth-first search, as developed by Tarjan and coauthors, is a fundamental technique of efficient algorithm design for graphs [23]. This note presents depth-first search algorithms for two basic problems, strong and biconnected components. Previous algorithms either compute auxiliary quantities based on the depth-first search tree (e.g., LOWPOINT values) or require two passes. We present one-pa...
متن کامل